Termination w.r.t. Q proof of TRS/SK902.57.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

[f₂, g₁, h₂, a]

Status:

a: multiset
f₂: [1,2]
g₁: [1]
h₂: [1,2]